A π-calculus with explicit substitutions
نویسندگان
چکیده
منابع مشابه
Explicit substitutions for the - calculus ?
The-calculus is a-calculus with a control-like operator whose reduction rules are closely related to normalisation procedures in classical logic. We introduce exp, an explicit substitution calculus for , and study its properties. In particular, we show that exp preserves strong normalisation, which provides us with the rst example {moreover a very natural one indeed{ of explicit substitution ca...
متن کاملCINNI – A Generic Calculus of Explicit Substitutions and its Application to λ-, ς- and π-Calculi
We approach the general problem of representing higher-order languages, that are usually equipped with special variable binding constructs, in a less specialized firstorder framework such as membership equational logic and the corresponding version of rewriting logic. The solution we propose is based on CINNI, a new calculus of explicit substitutions that makes use of a term representation that...
متن کاملA Pi-Calculus with Explicit Substitutions: the Late Semantics
A new formulation of the-calculus, where name instantiation is handled explicitly, is presented. The explicit handling of name instantiation allows us to reduce the-calculus transitional semantics to a standard SOS framework. Hence,-calculus bisimulation models can take fully advantage of the SOS meta-theory developed for`static' process calculi. For instance, complete axiomatic characterizatio...
متن کاملA Calculus of Explicit Substitutions Which Preserves Strong Normalisation , a Calculus of Explicit Substitutions Which Preserves Strong Normalisation
Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and LLvy to internalise substitutions into-calculus and to propose a mechanism for computing on substitutions. is another view of the same concept which aims to explain the process of substitution and to decompose it in small steps. is simple and preserves strong normalisation. Apparently that important property cannot stay...
متن کاملExplicit Substitutions for the Lambda � Mu Calculus �
We present a con uent rewrite system which extents a previous calculus of explicit substitu tions for the lambda calculus HaLe to Parigot s untyped lambda mu calculus Par This extension embeds the lambda mu calculus as a sub theory and provides the basis for a theoretical framework to study the abstract properties of implementations of functional pro gramming languages enriched with control str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00063-1